The Capacity of the Vector Gaussian Watermarking Game
نویسندگان
چکیده
We compute the coding capacity of the watermarking game for a vector Gaussian covertext and squared-error distortions. As with a scalar Gaussian covertext [1], the capacity does not depend on knowledge of the covertext at the decoder. Unlike the scalar version, an attacker based on the rate distortion solution (i.e. optimal compression) is suboptimal.
منابع مشابه
Introducing Capacity Surface to Estimate Watermarking Capacity
One of the most important parameters in evaluating a watermarking algorithm is its capacity. Generally, watermarking capacity is expressed by bits per pixel (bpp) unit measure. But this measure does not show what the side effects would be on image quality, watermark robustness and capacity. In this paper we propose a three dimensional measure named Capacity surface which shows the effects of ca...
متن کاملOptimum decoder for multiplicative spread spectrum image watermarking with Laplacian modeling
This paper investigates the multiplicative spread spectrum watermarking method for the image. The information bit is spreaded into middle-frequency Discrete Cosine Transform (DCT) coefficients of each block of an image using a generated pseudo-random sequence. Unlike the conventional signal modeling, we suppose that both signal and noise are distributed with Laplacian distribution, because the ...
متن کاملPractical watermarking scheme based on wide spread spectrum and game theory
In this paper, we consider the implementation of robust watermarking scheme for non i.i.d. Gaussian signals and distortion based on perceptual metrics. We consider this problem as a communication problem and formulated it as a game between an attacker and an embedder in order to establish its theoretical performance. We first show that known parallel Gaussian channels technique does not lead to...
متن کاملColour spread transform data hiding capacity using complex wavelets
Information theoretic methods of calculating the capacity of data hiding schemes allow for objective comparisons of watermarking algorithms. This paper applies these methods to the case of colour image watermarking, using a dual tree complex wavelet transform and non redundant complex wavelet transform along with a spread transform data hiding algorithm to compare levels of capacity between the...
متن کاملInformation theoretic analysis of watermarking systems
Watermarking models a copyright protection mechanism where an original data sequence is modi ed before distribution to the public in order to embed some extra information. The embedding should be transparent (i.e., the modi ed data should be similar to the original data) and robust (i.e., the information should be recoverable even if the data is modi ed further). In this thesis, we describe the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001